Randomized algorithms and upper bounds for multiple domination in graphs and networks

We consider four different types of multiple domination and provide new improved upper bounds for the kand k-tuple domination numbers. They generalise two classical bounds for the domination number and are better than a number of known upper bounds for these two multiple domination parameters. Also, we explicitly present and systematize randomized algorithms for finding multiple dominating sets, whose expected orders satisfy new and recent upper bounds. The algorithms for kand k-tuple dominating sets are of linear time in terms of the number of edges of the input graph, and they can be implemented as local distributed algorithms. Note that the corresponding multiple domination problems are known to be NP -complete.